A Parallel Compact Gannet Optimization Algorithm for Solving Engineering Optimization Problems
نویسندگان
چکیده
The Gannet Optimization Algorithm (GOA) has good performance, but there is still room for improvement in memory consumption and convergence. In this paper, an improved proposed to solve five engineering optimization problems. compact strategy enables the GOA save a large amount of memory, parallel communication allows algorithm avoid falling into local optimal solutions. We improve through combination strategy, we name Parallel Compact (PCGOA). performance study PCGOA on CEC2013 benchmark demonstrates advantages our new method various aspects. Finally, results solving problems show that can find global solution more accurately.
منابع مشابه
FOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems
These days randomized-based population optimization algorithms are in wide use in different branches of science such as bioinformatics, chemical physics andpower engineering. An important group of these algorithms is inspired by physical processes or entities’ behavior. A new approach of applying optimization-based social relationships among the members of a community is investigated in this pa...
متن کاملEFFICIENCY OF IMPROVED HARMONY SEARCH ALGORITHM FOR SOLVING ENGINEERING OPTIMIZATION PROBLEMS
Many optimization techniques have been proposed since the inception of engineering optimization in 1960s. Traditional mathematical modeling-based approaches are incompetent to solve the engineering optimization problems, as these problems have complex system that involves large number of design variables as well as equality or inequality constraints. In order to overcome the various difficultie...
متن کاملA Parallel Global Optimization Algorithm for Solving Inverse Problems
In this paper two improved versions of Genetic Clustering (GC) algorithm [1] are described. GC is a parallel global optimization algorithm that was designed in order to solve such parameter inverse problems in which an approximation of certain level sets (central parts of basins of attractions of local minimizers) is required. The approximation of these sets can be useful when some additional c...
متن کاملA Parallel Memetic Algorithm for Solving Optimization Problems
In this paper we examine 10 different functions in order (a) to test specific parameter of a parallel execution of memetic algorithms and (b) to evaluate the general computational behavior of MAs. The available theoretical analysis on memetic algorithms does not offer a tool which could help in a generalized adjustment of control parameters, leaving the choice of the proper operators, parameter...
متن کاملWater cycle algorithm – A novel metaheuristic optimization method for solving constrained engineering optimization problems
0045-7949/$ see front matter 2012 Elsevier Ltd. A http://dx.doi.org/10.1016/j.compstruc.2012.07.010 ⇑ Corresponding author. Tel.: +60 379675266; fax: E-mail addresses: [email protected] (H. hoo.com (A. Sadollah), [email protected] (A m.edu.my (M. Hamdi). This paper presents a new optimization technique called water cycle algorithm (WCA) which is applied to a number of constrained op...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2023
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math11020439